PRESERVATION OF UNBOUNDEDNESS AND THE CONSISTENCY OF b < s
نویسنده
چکیده
Definition 1. Let f and g be functions in ω. We say that f is dominated by g iff there is some natural number n such that f ≤n g, i.e. (∀i ≥ n)(f(i) ≤ g(i)). Then <∗= ∪ ≤n is called the bounding relation on ω. If F is a family of functions in ω we say that F is dominated by the function g, and denote it by F <∗ g iff (∀f ∈ F)(f <∗ g). We say that F is unbounded (also not dominated) iff there is no function g ∈ ω which dominates it.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Strong consistency of MLE for finite mixtures of location-scale distributions when the scale parameters are exponentially small
In finite mixture of location-scale distributions maximum likelihood estimator does not exist because of the unboundedness of the likelihood function when the scale parameter of some mixture component approaches zero. In order to study the strong consistency of maximum likelihood estimator, we consider the case that the scale parameters of the component distributions are restricted from below b...
متن کاملStrong consistency of MLE for finite mixtures of location-scale distributions when the scale parameters are exponentially small
In a finite mixture of location-scale distributions maximum likelihood estimator does not exist because of the unboundedness of the likelihood function when the scale parameter of some mixture component approaches zero. In order to study the strong consistency of maximum likelihood estimator, we consider the case that the scale parameters of the component distributions are restricted from below...
متن کاملAbstract Interpretation of Graph Grammars
Interpretation of Graph Grammars ? Jörg Bauer and Reinhard Wilhelm Informatik; Univ. des Saarlandes; Saarbrücken, Germany. {joba,wilhelm}@cs.uni-sb.de Abstract. Many communication systems, distributed algorithms, or heap manipulating programs are hard to verify due to their inherent unboundedness. Their semantics can be described by evolving graphs. Graph grammars are a natural, intuitive, and ...
متن کاملEfficient Linear Unboundedness Testing: Algorithm and Applications to Translational Assembly Planning
We address the problem of efficiently testing for linear unboundedness and its applications to translational assembly planning. We describe a new algorithm that performs the test by solving a single homogeneous system of equations followed by a single linear feasibility test. We show that testing for unboundedness is computationally at least as hard as these two subproblems. The new algorithm i...
متن کاملEeciently Testing for Unboundedness and M-handed Assembly
We address the problem of eeciently determining whether the intersection of a given set of d-dimensional halfspaces is unbounded. It is shown that detecting unboundedness can be reduced to a single linear range computation followed by a single linear feasibility test. In contrast , detecting unboundedness is at least as hard as linear feasibility testing and maximization. Our analysis suggests ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005